Soundness for Resource-Constrained Workflow Nets Is Decidable

Soundness of Workflow Nets with an Unbounded Resource is Decidable

In this work we consider modeling of workflow systems with Petri nets. A resource workflow net (RWF-net) is a workflow net, supplied with an additional set of initially marked resource places. Resources can be consumed and/or produced by transitions. We do not constrain neither the intermediate nor final resource markings, hence a net can have an infinite number of different reachable states. A...

Generalised Soundness of Workflow Nets Is Decidable

Structural soundness of workflow nets is decidable

The problem of deciding whether a given workflow net is k-sound for some k 1 is known as structural soundness. We prove that structural soundness of workflow nets is decidable.  2005 Elsevier B.V. All rights reserved.

Dynamic Soundness in Resource-Constrained Workflow Nets

Workflow Petri nets (wf-nets) are an important formalism for the modeling of business processes. For them we are typically interested in the soundness problem, that intuitively consists in deciding whether several concurrent executions can always terminate properly. ResourceConstrained Workflow Nets (rcfw-nets) are wf-nets enriched with static places, that model global resources. In this paper ...

Soundness of Resource-Constrained Workflow Nets

We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is used. We give a necessary and sufficient condition for soundness and an algorithm that checks it.